Dynamic Mesh Refinement with Quad Trees and Off-Centers
نویسندگان
چکیده
Many algorithms exist for producing quality meshes when the input point cloud is known a priori. However, modern finite element simulations and graphics applications need to change the input set during the simulation dynamically. In this paper, we show a dynamic algorithm for building and maintaining a quadtree under insertions into and deletions from an input point set in any fixed dimension. This algorithm runs in O(lg L/s) time per update, where L/s is the spread of the input. The result of the dynamic quadtree can be combined with a postprocessing step to generate and maintain a simplicial mesh under dynamic changes in the same asymptotic runtime. The mesh output by the dynamic algorithm is of good quality (it has no small dihedral angle), and is optimal in size. This gives the first time-optimal dynamic algorithm that outputs good quality meshes in any dimension. As a second result, we dynamize the quadtree postprocessing technique of Har-Peled and Üngör for generating meshes in two dimensions. When composed with the dynamic quadtree algorithm, the resulting algorithm yields quality meshes that are the smallest known in practice, while guaranteeing the same asymptotic optimality guarantees. † Toyota Technological Institute at Chicago This work was supported in part by the National Science Foundation under grants ACI 0086093, CCR-0085982 and CCR0122581.
منابع مشابه
Multiresolution Surface Reconstruction from Scattered Data Based on Hybrid Meshes
We present a novel technique to extract a multiresolution surface representation from a dense set of unorganized points within three dimensional space. Without utilization of additional connectivity or topological information our procedure is able to efficiently produce a precise and topologicaly correct reconstruction of the underlying model. Based on a hierarchical spatial partitioning scheme...
متن کاملA New Set of Hexahedral Meshes Local Transformations
The modification of hexahedral meshes is difficult to perform since their structure does not allow easy local refinement or un-refinement such that the modification does not go through the boundary. In this paper we prove that the set of hex flipping transformations of Bern et. al. [1] is the only possible local modification on a geometrical hex mesh with less than 5 edges per vertex. We propos...
متن کاملImplicit Hierarchical Quad-Dominant Meshes
We present a method for producing quad-dominant subdivided meshes, which supports both adaptive refinement and adaptive coarsening. A hierarchical structure is stored implicitly in a standard half-edge data structure, while allowing us to efficiently navigate through the different level of subdivision. Subdivided meshes contain a majority of quad elements and a moderate amount of triangles and ...
متن کاملAdaptive Quad Mesh Simplification
We present an improved algorithm for the progressive simplification of quad meshes, which adapts the resolution of the mesh to details of the modeled shape. We extend previous work [TPC∗10], by simplifying the approach and combining it with the concept of Fitmaps introduced in [PPT∗10]. The new algorithm has several advantages: it is simpler and more robust; it does not need a parametrization o...
متن کاملTechnical Note: Algorithms for Optimal Dyadic Decision Trees
A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, replacing the dynamic programming alg...
متن کامل